Total Global Dominator Coloring of Trees and Unicyclic Graphs
نویسندگان
چکیده
A total global dominator coloring of a graph is proper vertex with respect to which every in dominates color class, not containing and does dominate another class. The minimum number colors required such called the chromatic number, denoted by . In this paper, trees unicyclic graphs are explored.
منابع مشابه
Dominator Coloring of Central Graphs
J. A. Bondy and U. S. R. Murty, Graph theory with Applications, London: MacMillan (1976). R. M. Gera, On Dominator Colorings in Graphs, Graph Theory Notes of New York LIT, 25-30 (2007) F. Harary, Graph Theory, Narosa Publishing 1969. D. Michalak, On Middle and Total graphs with Coarseness Number Equal 1, Lecture Notes in Mathematics, Volume 1018: Graph Theory, Springer-Verlag, Berlin, 139 – 150...
متن کاملLeap Zagreb indices of trees and unicyclic graphs
By d(v|G) and d_2(v|G) are denoted the number of first and second neighborsof the vertex v of the graph G. The first, second, and third leap Zagreb indicesof G are defined asLM_1(G) = sum_{v in V(G)} d_2(v|G)^2, LM_2(G) = sum_{uv in E(G)} d_2(u|G) d_2(v|G),and LM_3(G) = sum_{v in V(G)} d(v|G) d_2(v|G), respectively. In this paper, we generalizethe results of Naji et al. [Commun. Combin. Optim. ...
متن کاملThe Hyper-Zagreb Index of Trees and Unicyclic Graphs
Topological indices are widely used as mathematical tools to analyze different types of graphs emerged in a broad range of applications. The Hyper-Zagreb index (HM) is an important tool because it integrates the first two Zagreb indices. In this paper, we characterize the trees and unicyclic graphs with the first four and first eight greatest HM-value, respectively.
متن کاملThe second geometric-arithmetic index for trees and unicyclic graphs
Let $G$ be a finite and simple graph with edge set $E(G)$. The second geometric-arithmetic index is defined as $GA_2(G)=sum_{uvin E(G)}frac{2sqrt{n_un_v}}{n_u+n_v}$, where $n_u$ denotes the number of vertices in $G$ lying closer to $u$ than to $v$. In this paper we find a sharp upper bound for $GA_2(T)$, where $T$ is tree, in terms of the order and maximum degree o...
متن کاملDominator Chromatic Number of Middle and Total Graphs
Dominator chromatic number of middle and total graphs of various graph families is found in this paper. Also these parameters are compared with dominator chromatic number of their respective graph families.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Baghdad Science Journal
سال: 2023
ISSN: ['2078-8665', '2411-7986']
DOI: https://doi.org/10.21123/bsj.2023.6457